Injective models of G-disconnected simplicial sets

نویسندگان

  • MAREK GOLASIŃSKI
  • Marek GOLASINSKI
  • MAREK GOLASINSKI
چکیده

© Annales de l’institut Fourier, 1997, tous droits réservés. L’accès aux archives de la revue « Annales de l’institut Fourier » (http://annalif.ujf-grenoble.fr/) implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/legal.php). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier doit contenir la présente mention de copyright.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New methods for constructing shellable simplicial complexes

A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$. If $mathbb{K}$ is a field, then there is a one-to-one correspondence between clutters on $V$ and square-free monomial ideals in $mathbb{K}[x_1,ldots,x_n]$ as follows: To each clutter $mathcal{C}...

متن کامل

2 00 7 Complexes of Injective Words and Their Commutation Classes

Let S be a finite alphabet. An injective word over S is a word over S such that each letter in S appears at most once in the word. We study Boolean cell complexes of injective words over S and their commutation classes. This generalizes work by Farmer and by Björner and Wachs on the complex of all injective words. Specifically, for an abstract simplicial complex ∆, we consider the Boolean cell ...

متن کامل

Complexes of Injective Words and Their Commutation Classes

Let S be a finite alphabet. An injective word over S is a word over S such that each letter in S appears at most once in the word. We study Boolean cell complexes of injective words over S and their commutation classes. This generalizes work by Farmer and by Björner and Wachs on the complex of all injective words. Specifically, for an abstract simplicial complex ∆, we consider the Boolean cell ...

متن کامل

Bijective Mappings of Meshes with Boundary and the Degree in Mesh Processing

This paper introduces three sets of sufficient conditions, for generating bijective simplicial mappings of manifold meshes. A necessary condition for a simplicial mapping of a mesh to be injective is that it either maintains the orientation of all elements or flips all the elements. However, these conditions are known to be insufficient for injectivity of a simplicial map. In this paper we prov...

متن کامل

An introduction to simplicial sets

This is an elementary introduction to simplicial sets, which are generalizations of ∆-complexes from algebraic topology. The theory of simplicial sets provides a way to express homotopy and homology without requiring topology. This paper is meant to be accessible to anyone who has had experience with algebraic topology and has at least basic knowledge of category theory. An important part of si...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017